0.11/0.14 % Problem : Vampire---4.8_10617 : TPTP v0.0.0. Released v0.0.0. 0.11/0.15 % Command : run_E %s %d THM 0.15/0.36 % Computer : n027.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.36 % CPULimit : 1440 0.15/0.36 % WCLimit : 180 0.15/0.36 % DateTime : Mon Jul 3 13:25:47 EDT 2023 0.15/0.36 % CPUTime : 0.22/0.52 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.jeYBDwJGXk/Vampire---4.8_10617 0.22/0.52 # Version: 3.1pre001-ho 0.91/0.69 # Preprocessing class: HSLSSMSSSSSNHSA. 0.91/0.69 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.91/0.69 # Starting full_lambda_9 with 900s (5) cores 0.91/0.69 # Starting new_ho_11 with 180s (1) cores 0.91/0.69 # Starting sh2l with 180s (1) cores 0.91/0.69 # Starting new_bool_6 with 180s (1) cores 0.91/0.69 # sh2l with pid 10797 completed with status 0 0.91/0.69 # Result found by sh2l 0.91/0.69 # Preprocessing class: HSLSSMSSSSSNHSA. 0.91/0.69 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.91/0.69 # Starting full_lambda_9 with 900s (5) cores 0.91/0.69 # Starting new_ho_11 with 180s (1) cores 0.91/0.69 # Starting sh2l with 180s (1) cores 0.91/0.69 # SinE strategy is gf120_gu_RUU_F100_L01000 0.91/0.69 # Search class: HGUSM-FFLF31-MHSFFFNN 0.91/0.69 # partial match(3): HGUSM-FSLM32-MHSFFFNN 0.91/0.69 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.91/0.69 # Starting new_ho_10 with 98s (1) cores 0.91/0.69 # new_ho_10 with pid 10801 completed with status 0 0.91/0.69 # Result found by new_ho_10 0.91/0.69 # Preprocessing class: HSLSSMSSSSSNHSA. 0.91/0.69 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.91/0.69 # Starting full_lambda_9 with 900s (5) cores 0.91/0.69 # Starting new_ho_11 with 180s (1) cores 0.91/0.69 # Starting sh2l with 180s (1) cores 0.91/0.69 # SinE strategy is gf120_gu_RUU_F100_L01000 0.91/0.69 # Search class: HGUSM-FFLF31-MHSFFFNN 0.91/0.69 # partial match(3): HGUSM-FSLM32-MHSFFFNN 0.91/0.69 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.91/0.69 # Starting new_ho_10 with 98s (1) cores 0.91/0.69 # Preprocessing time : 0.003 s 0.91/0.69 # Presaturation interreduction done 0.91/0.69 0.91/0.69 # Proof found! 0.91/0.69 # SZS status Theorem 0.91/0.69 # SZS output start CNFRefutation 0.91/0.69 thf(decl_36, type, modula1936294176_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 0.91/0.69 thf(decl_37, type, modula1144073633_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 0.91/0.69 thf(decl_52, type, a2: a). 0.91/0.69 thf(decl_53, type, b: a). 0.91/0.69 thf(decl_54, type, c: a). 0.91/0.69 thf(decl_55, type, inf: a > a > a). 0.91/0.69 thf(decl_56, type, less_eq: a > a > $o). 0.91/0.69 thf(decl_57, type, sup: a > a > a). 0.91/0.69 thf(conj_0, conjecture, ((sup @ (inf @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c)) @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))=(inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ (inf @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c)) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))), file('/export/starexec/sandbox/tmp/tmp.jeYBDwJGXk/Vampire---4.8_10617', conj_0)). 0.91/0.69 thf(fact_1_local_Oinf_Ocommute, axiom, ![X1:a, X3:a]:(((inf @ X1 @ X3)=(inf @ X3 @ X1))), file('/export/starexec/sandbox/tmp/tmp.jeYBDwJGXk/Vampire---4.8_10617', fact_1_local_Oinf_Ocommute)). 0.91/0.69 thf(fact_7_local_Osup_Ocommute, axiom, ![X1:a, X3:a]:(((sup @ X1 @ X3)=(sup @ X3 @ X1))), file('/export/starexec/sandbox/tmp/tmp.jeYBDwJGXk/Vampire---4.8_10617', fact_7_local_Osup_Ocommute)). 0.91/0.69 thf(fact_126_local_Omodular, axiom, ![X2:a, X11:a, X12:a]:((((sup @ X2 @ (inf @ X11 @ X12))=(inf @ X11 @ (sup @ X2 @ X12)))<=(less_eq @ X2 @ X11))), file('/export/starexec/sandbox/tmp/tmp.jeYBDwJGXk/Vampire---4.8_10617', fact_126_local_Omodular)). 0.91/0.69 thf(fact_6_local_Osup_Oassoc, axiom, ![X1:a, X3:a, X4:a]:(((sup @ (sup @ X1 @ X3) @ X4)=(sup @ X1 @ (sup @ X3 @ X4)))), file('/export/starexec/sandbox/tmp/tmp.jeYBDwJGXk/Vampire---4.8_10617', fact_6_local_Osup_Oassoc)). 0.91/0.69 thf(fact_16_local_Ob__join__d, axiom, ![X3:a, X1:a, X4:a]:(((sup @ X3 @ (modula1936294176_aux_a @ inf @ sup @ X1 @ X3 @ X4))=(sup @ X3 @ (inf @ X4 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.jeYBDwJGXk/Vampire---4.8_10617', fact_16_local_Ob__join__d)). 0.91/0.69 thf(fact_92_local_Oinf_Ocobounded2, axiom, ![X1:a, X3:a]:((less_eq @ (inf @ X1 @ X3) @ X3)), file('/export/starexec/sandbox/tmp/tmp.jeYBDwJGXk/Vampire---4.8_10617', fact_92_local_Oinf_Ocobounded2)). 0.91/0.69 thf(c_0_7, negated_conjecture, ((sup @ (inf @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c)) @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))!=(inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ (inf @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c)) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.91/0.69 thf(c_0_8, plain, ![X386:a, X387:a]:(((inf @ X386 @ X387)=(inf @ X387 @ X386))), inference(variable_rename,[status(thm)],[fact_1_local_Oinf_Ocommute])). 0.91/0.69 thf(c_0_9, negated_conjecture, ((sup @ (inf @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c)) @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))!=(inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ (inf @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c)) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.91/0.69 thf(c_0_10, plain, ![X2:a, X1:a]:(((inf @ X1 @ X2)=(inf @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.91/0.69 thf(c_0_11, plain, ![X520:a, X521:a]:(((sup @ X520 @ X521)=(sup @ X521 @ X520))), inference(variable_rename,[status(thm)],[fact_7_local_Osup_Ocommute])). 0.91/0.69 thf(c_0_12, plain, ![X2:a, X11:a, X12:a]:(((less_eq @ X2 @ X11)=>((sup @ X2 @ (inf @ X11 @ X12))=(inf @ X11 @ (sup @ X2 @ X12))))), inference(fof_simplification,[status(thm)],[fact_126_local_Omodular])). 0.91/0.69 thf(c_0_13, negated_conjecture, ((sup @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))) @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))!=(inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10]), c_0_10])). 0.91/0.69 thf(c_0_14, plain, ![X2:a, X1:a]:(((sup @ X1 @ X2)=(sup @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.91/0.69 thf(c_0_15, plain, ![X506:a, X507:a, X508:a]:(((sup @ (sup @ X506 @ X507) @ X508)=(sup @ X506 @ (sup @ X507 @ X508)))), inference(variable_rename,[status(thm)],[fact_6_local_Osup_Oassoc])). 0.91/0.69 thf(c_0_16, plain, ![X475:a, X476:a, X477:a]:((~(less_eq @ X475 @ X476)|((sup @ X475 @ (inf @ X476 @ X477))=(inf @ X476 @ (sup @ X475 @ X477))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])). 0.91/0.69 thf(c_0_17, negated_conjecture, ((sup @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))) @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))!=(inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)) @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14]), c_0_14])). 0.91/0.69 thf(c_0_18, plain, ![X1:a, X2:a, X3:a]:(((sup @ (sup @ X1 @ X2) @ X3)=(sup @ X1 @ (sup @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.91/0.69 thf(c_0_19, plain, ![X1:a, X3:a, X2:a]:((((sup @ X1 @ (inf @ X2 @ X3))=(inf @ X2 @ (sup @ X1 @ X3)))|~((less_eq @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.91/0.69 thf(c_0_20, plain, ![X621:a, X622:a, X623:a]:(((sup @ X621 @ (modula1936294176_aux_a @ inf @ sup @ X622 @ X621 @ X623))=(sup @ X621 @ (inf @ X623 @ X622)))), inference(variable_rename,[status(thm)],[fact_16_local_Ob__join__d])). 0.91/0.69 thf(c_0_21, plain, ![X466:a, X467:a]:((less_eq @ (inf @ X466 @ X467) @ X467)), inference(variable_rename,[status(thm)],[fact_92_local_Oinf_Ocobounded2])). 0.91/0.69 thf(c_0_22, negated_conjecture, ((sup @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))) @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))!=(inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ a2 @ (sup @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c) @ (inf @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c) @ (sup @ b @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))))))), inference(rw,[status(thm)],[c_0_17, c_0_18])). 0.91/0.69 thf(c_0_23, plain, ![X3:a, X2:a, X1:a]:((((sup @ (inf @ X1 @ X2) @ X3)=(inf @ X1 @ (sup @ X3 @ X2)))|~((less_eq @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_14, c_0_19])). 0.91/0.69 thf(c_0_24, plain, ![X1:a, X3:a, X2:a]:(((sup @ X1 @ (modula1936294176_aux_a @ inf @ sup @ X2 @ X1 @ X3))=(sup @ X1 @ (inf @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_20])). 0.91/0.69 thf(c_0_25, plain, ![X1:a, X2:a]:((less_eq @ (inf @ X1 @ X2) @ X2)), inference(split_conjunct,[status(thm)],[c_0_21])). 0.91/0.69 thf(c_0_26, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_14]), c_0_18]), c_0_24]), c_0_10]), c_0_10]), c_0_24]), c_0_10]), c_0_10]), c_0_24]), c_0_10]), c_0_10]), c_0_25])]), ['proof']). 0.91/0.69 # SZS output end CNFRefutation 0.91/0.69 # Parsed axioms : 293 0.91/0.69 # Removed by relevancy pruning/SinE : 174 0.91/0.69 # Initial clauses : 150 0.91/0.69 # Removed in clause preprocessing : 5 0.91/0.69 # Initial clauses in saturation : 145 0.91/0.69 # Processed clauses : 785 0.91/0.69 # ...of these trivial : 73 0.91/0.69 # ...subsumed : 334 0.91/0.69 # ...remaining for further processing : 378 0.91/0.69 # Other redundant clauses eliminated : 63 0.91/0.69 # Clauses deleted for lack of memory : 0 0.91/0.69 # Backward-subsumed : 29 0.91/0.69 # Backward-rewritten : 14 0.91/0.69 # Generated clauses : 8165 0.91/0.69 # ...of the previous two non-redundant : 6628 0.91/0.69 # ...aggressively subsumed : 0 0.91/0.69 # Contextual simplify-reflections : 18 0.91/0.69 # Paramodulations : 8032 0.91/0.69 # Factorizations : 0 0.91/0.69 # NegExts : 0 0.91/0.69 # Equation resolutions : 63 0.91/0.69 # Total rewrite steps : 4069 0.91/0.69 # Propositional unsat checks : 0 0.91/0.69 # Propositional check models : 0 0.91/0.69 # Propositional check unsatisfiable : 0 0.91/0.69 # Propositional clauses : 0 0.91/0.69 # Propositional clauses after purity: 0 0.91/0.69 # Propositional unsat core size : 0 0.91/0.69 # Propositional preprocessing time : 0.000 0.91/0.69 # Propositional encoding time : 0.000 0.91/0.69 # Propositional solver time : 0.000 0.91/0.69 # Success case prop preproc time : 0.000 0.91/0.69 # Success case prop encoding time : 0.000 0.91/0.69 # Success case prop solver time : 0.000 0.91/0.69 # Current number of processed clauses : 262 0.91/0.69 # Positive orientable unit clauses : 60 0.91/0.69 # Positive unorientable unit clauses: 8 0.91/0.69 # Negative unit clauses : 9 0.91/0.69 # Non-unit-clauses : 185 0.91/0.69 # Current number of unprocessed clauses: 5908 0.91/0.69 # ...number of literals in the above : 12319 0.91/0.69 # Current number of archived formulas : 0 0.91/0.69 # Current number of archived clauses : 109 0.91/0.69 # Clause-clause subsumption calls (NU) : 12299 0.91/0.69 # Rec. Clause-clause subsumption calls : 5565 0.91/0.69 # Non-unit clause-clause subsumptions : 293 0.91/0.69 # Unit Clause-clause subsumption calls : 379 0.91/0.69 # Rewrite failures with RHS unbound : 0 0.91/0.69 # BW rewrite match attempts : 326 0.91/0.69 # BW rewrite match successes : 183 0.91/0.69 # Condensation attempts : 785 0.91/0.69 # Condensation successes : 0 0.91/0.69 # Termbank termtop insertions : 98775 0.91/0.69 0.91/0.69 # ------------------------------------------------- 0.91/0.69 # User time : 0.127 s 0.91/0.69 # System time : 0.009 s 0.91/0.69 # Total time : 0.137 s 0.91/0.69 # Maximum resident set size: 2656 pages 0.91/0.70 0.91/0.70 # ------------------------------------------------- 0.91/0.70 # User time : 0.135 s 0.91/0.70 # System time : 0.012 s 0.91/0.70 # Total time : 0.147 s 0.91/0.70 # Maximum resident set size: 2064 pages 0.91/0.70 % E---3.1 exiting 0.91/0.70 EOF